Fuzzy Attribute Logic: Attribute Implications, Their Validity, Entailment, and Non-redundant Basis∗
نویسندگان
چکیده
We present results related to if-then rules and extraction of if-then rules from data tables with fuzzy attibutes. We provide basic definitions and results related to validity of if-then rules, semantic entailment, non-redundant bases, automatic generation of non-redundant bases, and relationships to concept lattices over data with fuzzy attributes.
منابع مشابه
Properties of models of fuzzy attribute implications
This paper deals with closure properties of models of fuzzy attribute implications. Fuzzy attribute implications are particular IF-THEN rules which can be interpreted in data tables with fuzzy attributes and/or ranked data tables over domains with similarity relations. We show that models of any set of fuzzy attribute implications form a fuzzy closure system with hedge. Conversely, we show that...
متن کاملSemantic Entailment of Attribute-dependency Formulas and Their Non-redundant Bases
AD-formulas are simple formulas representing particular dependencies in data tables. We study AD-formulas from the logical point of view. In particular, we present results regarding the relationship of AD-formulas to attribute implications, models and entailment of AD-formulas, non-redundant bases, and computation of non-redundant bases.
متن کاملAttribute Dependencies for Data with Grades
This paper examines attribute dependencies in data that involve grades, such as a grade to which an object is red or a grade to which two objects are similar. We thus extend the classical agenda by allowing graded, or “fuzzy”, attributes instead of Boolean, yes-or-no attributes in case of attribute implications, and allowing approximate match based on degrees of similarity instead of exact matc...
متن کاملFuzzy attribute logic: syntactic entailment and completeness
Fuzzy attribute implications are particular if-then rules which can be extracted from data tables with fuzzy attributes. We develop fuzzy attribute logic (FAL), its syntax, semantics, and prove a classical as well as Pavelka-style completeness theorem for FAL. Also, we present relationships to completeness of sets of attribute implications w.r.t. data tables. Because of the limited scope of the...
متن کاملFuzzy Attribute Implications: Computing Non-redundant Bases Using Maximal Independent Sets
This note describes a method for computation of non-redundant bases of attribute implications from data tables with fuzzy attributes. Attribute implications are formulas describing particular dependencies of attributes in data. A non-redundant basis is a minimal set of attribute implications such that each attribute implication which is true in a given data (semantically) follows from the basis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006